A hybrid heuristic solving the traveling salesman problem

This paper presents a new hybrid heuristic for solving the Traveling Salesman Problem, The algorithm is designed on the frame of a general optimization procedure which acts upon two steps, iteratively. In first step of the global search, a feasible tour is constructed based on insertion approach. In the second step the feasible tour found at the first step, is improved by a local search optimization procedure. The second part of the paper presents the performances of the proposed heuristic algorithm, on several test instances. The statistical analysis shows the effectiveness of the local search optimization procedure, in the graphical representation.peer-reviewe

A new hybrid heuristic algorithm for solving flowshop-scheduling problem

This paper presents a new heuristic hybrid algorithm for solving flow shop-scheduling problem. The algorithm is based on a general optimization method, which works in two stages. In the first stage it performs a global search of the optimal solution by a Monte Carlo based approach, while in the second stage of the local search, the previous solution is improved. To prove the effectiveness of the proposed method, numerous computational tests as well as a statistical analysis are presented.peer-reviewe